Is Word-Level Recursion Actually Recursion?
نویسندگان
چکیده
There is a longstanding debate in the literature about if, and where, recursion occurs prosodic structure. While there are clear cases of genuine at phrase level above, very few convincing word-level recursion. Most are—by definition—not recursive instead best analyzed as different constituents (e.g., Composite Group, Prosodic Word etc.). We show that two can easily be reanalyzed without if phonology prosody evaluated cyclically syntactic phase boundaries. Our analysis combines phase-based spell-out morpheme-specific subcategorization frames Cophonologies by Phase with Tri-P Mapping structure building. apparent due to cyclic spell-out, non-isomorphisms between requirements.
منابع مشابه
Recursion Is a Computational Eeect Recursion Is a Computational Eeect
In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could bene t from a combinator m x for expressing recursion over monadic types. We investigate three possible de nitions of m x and implement them in Haskell. Like traditional xpoint operators, there are two approaches to the de nition of m x: an unfolding one based on mathematical semantics, and an updating o...
متن کاملWhat is Radical Recursion?
Recursion or self-reference is a key feature of contemporary research and writing in semiotics. The paper commences by focusing on the role of recursion in poststructuralism. It is suggested that much of what passes for recursion in this field is in fact not recursive all the way down. After the paradoxical meaning of radical recursion is adumbrated, topology is employed to provide some example...
متن کاملTree Level Recursion Relations In General Relativity
Recently, tree-level recursion relations for scattering amplitudes of gluons in YangMills theory have been derived. In this note we propose a generalization of the recursion relations to tree-level scattering amplitudes of gravitons. We use the relations to derive new simple formulae for all amplitudes up to six gravitons. In particular, we present an explicit formula for the six graviton non-M...
متن کاملOn recursion
It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely ...
متن کاملLinear Recursion
We define two extensions of the typed linear lambda-calculus that yield minimal Turingcomplete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both approaches are compatible with linearity and typeability constraints. Both extensions of the typed linear lambda-calculus are minimal, in the sense that taking ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Languages
سال: 2021
ISSN: ['2226-471X']
DOI: https://doi.org/10.3390/languages6020100